Dealing with Incomplete Preferences in Soft Constraint Problems
نویسندگان
چکیده
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possible privacy issues. In this context, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define an algorithm to find a solution which is necessarily optimal, that is, optimal no matter what the missing data will be, with the aim to ask the user to reveal as few preferences as possible. Experimental results show that in many cases a necessarily optimal solution can be found without eliciting too many preferences.
منابع مشابه
Controllability of Temporal Problems with Preferences and Uncertainty
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. It is desirable to be able to handle events with uncertain duration while taking into account the user’s preferences on the timing of events. This also applies to many problems of space application domains. The two aspects have been dealt with separately, extending in two ways Temporal Constrai...
متن کاملUncertainty in Soft Constraint Problems
Preferences and uncertainty occur in many real-life problems. We are concerned with the coexistence of preference and uncertainty in the same problem. In particular, we consider uncertainty, defined by the theory of possibility [2], that is one non-probabilistic way of dealing with uncertainty, that comes from lack of data or imprecise knowledge. We propose a method to integrate fuzzy preferenc...
متن کاملControllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and uncertainty can be defined. We show how three classical notions of controllability (strong, weak and dynamic), which have been developed for uncertain temporal problems, can be generalised to handle also preferences. We...
متن کاملElicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or where there is an ongoing preference elicitation process. In this context, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define algorithms, that interleave s...
متن کاملPossibility Theory for Reasoning About Uncertain Soft Constraints
Preferences and uncertainty occur in many real-life problems. The theory of possibility is one non-probabilistic way of dealing with uncertainty, which allows for easy integration with fuzzy preferences. In this paper we consider an existing technique to perform such an integration and, while following the same basic idea, we propose various alternative semantics which allow us to observe both ...
متن کامل